#include<iostream>
#include<vector>
#include<queue>
#include<cstring>
#include<cmath>
#include<map>
#include<set>
#include<cstdio>
#include<algorithm>
#define debug(a) cout<<#a<<"="<<a<<endl;
using namespace std;
const int maxn=2e5+1000;
typedef long long LL;
inline LL read(){LL x=0,f=1;char ch=getchar();	while (!isdigit(ch)){if (ch=='-') f=-1;ch=getchar();}while (isdigit(ch)){x=x*10+ch-48;ch=getchar();}
return x*f;}
LL ksm(LL a,LL k){
   LL res=1;
   while(k>0){
      if(k&1) res=res*a;
      k>>=1;
      a=a*a;
   }
   return res;
}
LL conc(LL a,LL b){
   LL temp=b;LL num=0;
   while(temp>0){
      temp/=10;
      num++;
   }
   return a*ksm(10,num)+b;
}
int main(void){
   ///cin.tie(0);std::ios::sync_with_stdio(false);
   LL t;cin>>t;
   while(t--){
      LL sum=0;
      LL A,B;cin>>A>>B;
      for(LL i=1;i<=A;i++){
         for(LL j=1;j<=B;j++){
             if(i*j+i+j==conc(i,j)){
                cout<<"i="<<i<<" "<<"j="<<j<<"\n";
                sum++;

             }
         }
      }
      cout<<"sum="<<sum<<"\n";
   }
   return 0;
}
